基于线特征及迭代最近点算法的地基建筑物点云自动配准方法

为克服迭代最近点(ICP)算法易陷入局部最优的缺陷，提出一种基于线特征及ICP算法的地基建筑物点云自动配准方法。首先，基于法向一致性进行建筑物点云平面分割；接着，采用alpha-shape算法进行点簇轮廓线提取，并拆分和拟合处理得到特征线段；然后，以线对作为配准基元，以线对夹角和距离作为相似性测度进行同名特征匹配，实现建筑物点云的粗配准；最后，以粗配准结果为初值，进一步采用ICP算法完成点云精确配准。利用两组部分重叠的建筑物点云进行配准实验，实验结果表明，采用由粗到精的配准方法能有效改善ICP算法对初值依赖的问题，实现具有部分重叠的建筑物点云的有效配准。     

DEM: Deep Entity Matching Across Heterogeneous Information Networks

Heterogeneous information networks, which consist of multi-typed vertices representing objects and multi-typed edges representing relations between objects, are ubiquitous in the real world. In this paper, we study the problem of entity matching for heterogeneous information networks based on distributed network embedding and multi-layer perceptron with a highway network, and we propose a new method named DEM short for Deep Entity Matching. In contrast to the traditional entity matching methods, DEM utilizes the multi-layer perceptron with a highway network to explore the hidden relations to improve the performance of matching. Importantly, we incorporate DEM with the network embedding methodology, enabling highly efficient computing in a vectorized manner. DEM’s generic modeling of both the network structure and the entity attributes enables it to model various heterogeneous information networks flexibly. To illustrate its functionality, we apply the DEM algorithm to two real-world entity matching applications: user linkage under the social network analysis scenario that predicts the same or matched users in different social platforms and record linkage that predicts the same or matched records in different citation networks. Extensive experiments on real-world datasets demonstrate DEM’s effectiveness and rationality.

     

结合预训练模型和语言知识库的文本匹配方法

针对文本匹配任务,该文提出一种大规模预训练模型融合外部语言知识库的方法。该方法在大规模预训练模型的基础上,通过生成基于WordNet的同义—反义词汇知识学习任务和词组—搭配知识学习任务引入外部语言学知识。进而,与MT-DNN多任务学习模型进行联合训练,以进一步提高模型性能。最后利用文本匹配标注数据进行微调。在MRPC和QQP两个公开数据集的实验结果显示,该方法可以在大规模预训练模型和微调的框架基础上,通过引入外部语言知识进行联合训练有效提升文本匹配性能。     

面向智能客服系统的情感分析技术

该文以阿里小蜜为例,对智能客服系统中的情感分析技术进行比较全面的介绍,包括情感分析算法模型的原理及其在智能客服系统的多个应用场景中的实际落地使用方式和效果分析。智能客服在解决客户高频业务问题的同时,也需要给客户提供多维度的、具有类人能力的助理、导购、语聊和娱乐等服务,提高客户对智能客服机器人的整体满意度。在此过程中,情感分析技术在机器人类人能力建设中起到了至关重要的作用。该文围绕智能客服系统中人机结合的服务形式,从六个维度总结和介绍了情感分析技术在智能客服系统中的应用场景,包括用户情感检测、用户情感安抚、情感生成式语聊、客服服务质检、会话满意度预估和智能人工入口。     

ZerNet: Convolutional Neural Networks on Arbitrary Surfaces Via Zernike Local Tangent Space Estimation

In this paper, we propose a novel formulation extending convolutional neural networks (CNN) to arbitrary two-dimensional manifolds using orthogonal basis functions called Zernike polynomials. In many areas, geometric features play a key role in understanding scientific trends and phenomena, where accurate numerical quantification of geometric features is critical. Recently, CNNs have demonstrated a substantial improvement in extracting and codifying geometric features. However, the progress is mostly centred around computer vision and its applications where an inherent grid-like data representation is naturally present. In contrast, many geometry processing problems deal with curved surfaces and the application of CNNs is not trivial due to the lack of canonical grid-like representation, the absence of globally consistent orientation and the incompatible local discretizations. In this paper, we show that the Zernike polynomials allow rigourous yet practical mathematical generalization of CNNs to arbitrary surfaces. We prove that the convolution of two functions can be represented as a simple dot product between Zernike coefficients and the rotation of a convolution kernel is essentially a set of 2 × 2 rotation matrices applied to the coefficients. The key contribution of this work is in such a computationally efficient but rigorous generalization of the major CNN building blocks.     

A fast branch,bound and remember algorithm for disassembly line balancing problem

In recent years, the interests of disassembly line have increased owing to economic reasons and the increase of environmental awareness. Effective line can provide many advantages in terms of economic aspect and it facilitates competition the companies with others. This study contributes to the relevant literature by a branch, bound and remember algorithm for disassembly line balancing problem with AND/OR precedence. The proposed exact solution method employs the memory-based dominance rule to eliminate the reduplicated sub-problems by storing all the searched sub-problems and to utilise cyclic best-first search strategy to obtain high-quality complete solutions fast. In this paper, minimising the number of stations is taken as the performance measure. The proposed methodology is tested on a set of 260 instances and compared with the mathematical model using CPLEX solver and five well-known metaheuristics. Computational results show that the proposed method is capable of obtaining the optimal solutions for all the tested instances with less than 0.1?seconds on average. Additionally, comparative study demonstrates that the proposed method is the state-of-the-art algorithm and outperforms the CPLEX solver and metaheuristics in terms of both solution quality and search speed aspects.     

飞机电子系统线路的故障维修分析

飞机电子线路在飞行过程中的运行状态会对飞机飞行性能造成直接影响。电子线路在实际工作中会产生一些故障,此种故障较为常见,并且故障表现形式会存在一定差异。本文能对飞机线路维修方法进行简单阐述,对线路故障检修措施进行简单分析,最后提出线路故障预防措施。     

基于多尺度结构特征的快速异源图像匹配

针对异源图像提出一种基于多尺度密集结构特征的快速匹配算法。算法首先利用Gabor滤波器逐像素提取图像中的结构响应,再根据主方向响应对多尺度结构特征融合,然后使用快速傅里叶变换在频域计算各特征分量图像之间的卷积,最后将卷积生成的系数矩阵求和计算出图像之间的相似性并选择相似性最大位置作为匹配结果输出。本文算法能有效适应异源图像间的非线性灰度变化和噪声干扰问题。测试使用可见光、红外、雷达图像组成的异源图像数据集对本文算法和现有算法进行测试比较,结果表明:本文算法的平均误匹配率最低,并且计算速度有明显优势。     

Optimal cost design of flow lines with reconfigurable machines for batch production

Modular reconfigurable machines offer the possibility to efficiently produce a family of different parts. This paper formalises a cost optimisation problem for flow lines equipped with reconfigurable machines which carry turrets, machining modules and single spindles. The proposed models take into account constraints related to: (i) design of machining modules, turrets, and machines, (ii) part locations, and (iii) precedence relations among operations. The goal is to minimise equipment cost while reaching a given output and satisfying all the constraints. A mixed integer programming model is developed for the considered optimisation problem. The approach is validated through an industrial case study and extensive numerical experiments.